A cluster-based cylindrical algebraic decomposition algorithm
نویسندگان
چکیده
منابع مشابه
Cylindrical Algebraic Decomposition I: The Basic Algorithm
Given I set of r-variatc integral polynomials, a cyllndrlt:al allebrtJJc decompoJition. (cad) of euclidean r-space E' partitioDIl E' into connected lubsets compatible with the zeros of tbe polynomials. Collins gave a cad construction algorithm in 1975, u part of • quantifier elimination procedure for real dosed fields. The algorithm has subsequently found diverse applications (optimization, cur...
متن کاملLayered Cylindrical Algebraic Decomposition
In this paper the idea of a Layered CAD is introduced, a truncation of a CAD to only high dimensional cells. Limiting to full-dimensional cells has already been investigated in the literature, but including another level can be beneficial for applications. A related topological property is defined and related to robotics motion planning. The distribution of cell dimensions in a CAD is investiga...
متن کاملRegular cylindrical algebraic decomposition
We show that a strong well-based cylindrical algebraic decomposition P of a bounded semi-algebraic set is a regular cell decomposition, in any dimension and independently of the method by which P is constructed. Being well-based is a global condition on P that holds for the output of many widely used algorithms. We also show the same for S of dimension at most 3 and P a strong cylindrical algeb...
متن کاملAdvances in cylindrical algebraic decomposition
Cylindrical Algebraic Decomposition (CAD) was initially introduced to tackle the classic problem of quantifier elimination over real closed algebraic fields, however it has since seen many applications in its own right. Given a set of polynomials, multiple algorithms exist to produce a CAD such that over each cell the polynomials have constant sign. Inherently doubly exponential in the number o...
متن کاملOptimising Problem Formulation for Cylindrical Algebraic Decomposition
Cylindrical algebraic decomposition (CAD) is an important tool for the study of real algebraic geometry with many applications both within mathematics and elsewhere. It is known to have doubly exponential complexity in the number of variables in the worst case, but the actual computation time can vary greatly. It is possible to offer different formulations for a given problem leading to great d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 1988
ISSN: 0747-7171
DOI: 10.1016/s0747-7171(88)80012-9